Explicit subspace designs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Derived and residual subspace designs

A generalization of forming derived and residual designs from tdesigns to subspace designs is proposed. A q-analog of a Theorem by van Tran, van Leijenhorst and Driessen is proven, stating that if for some (not necessarily realizable) parameter set the derived and residual parameter set are realizable, the same is true for the reduced parameter set. As a result, we get the existence of several ...

متن کامل

Subspace Designs Based on Algebraic Function Fields

Subspace designs are a (large) collection of high-dimensional subspaces {Hi} of Fq such that for any low-dimensional subspace W , only a small number of subspaces from the collection have non-trivial intersection with W ; more precisely, the sum of dimensions of W ∩Hi is at most some parameter L. The notion was put forth by Guruswami and Xing (STOC’13) with applications to list decoding variant...

متن کامل

Subspace system identification

We give a general overview of the state-of-the-art in subspace system identification methods. We have restricted ourselves to the most important ideas and developments since the methods appeared in the late eighties. First, the basis of linear subspace identification are summarized. Different algorithms one finds in literature (Such as N4SID, MOESP, CVA) are discussed and put into a unifyin...

متن کامل

Isotropic Constant Dimension Subspace Codes

 In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...

متن کامل

Maximally monotone linear subspace extensions of monotone subspaces: explicit constructions and characterizations

Monotone linear relations play important roles in variational inequality problems and quadratic optimizations. In this paper, we give explicit maximally monotone linear subspace extensions of a monotone linear relation in finite dimensional spaces. Examples are provided to illustrate our extensions.Our results generalize a recent result by Crouzeix and Ocaña-Anaya.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorica

سال: 2014

ISSN: 0209-9683,1439-6912

DOI: 10.1007/s00493-014-3169-1